Smoothest Approximation Formulas

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Smoothest Interpolants *

This paper is concerned with the problem of characterizing those functions of minimum LP-norm on their nth derivative, <=p=<, that sequentially take on the given values (ei). For p = the unique minimizing function is characterized. For p < fairly explicit necessary conditions are given.

متن کامل

Uniqueness of Smoothest Interpolants

(1) inf{‖f ‖p : f ∈ C [0, 1], f(ti) = ei, i = 1, . . . , m}, where ‖ · ‖p is the usual L [0, 1] norm, 1 ≤ p ≤ ∞, and to characterize f for which the above infimum is attained. If m ≤ n, then this problem has a simple solution. There are algebraic polynomials of degree at most n−1 satisfying the interpolation data, and any of these polynomials obviously solve our problem. If m > n then, in gener...

متن کامل

Cubature formulas, discrepancy, and nonlinear approximation

The main goal of this paper is to demonstrate connections between the following three big areas of research: the theory of cubature formulas (numerical integration), the discrepancy theory, and nonlinear approximation. In Section 1, we discuss a relation between results on cubature formulas and on discrepancy. In particular, we show how standard in the theory of cubature formulas settings can b...

متن کامل

Hermite-Pade' approximation and simultaneous quadrature formulas

We study the construction of a quadrature rule which allows the simultaneous integration of a given function with respect to different weights. This construction is built on the basis of simultaneous Padé approximation of a Nikishin system of functions. The properties of these approximants are used in the proof of convergence of the quadratures and positivity of the corresponding quadrature coe...

متن کامل

Certifying Unsatisfiability of Random 2k-SAT Formulas Using Approximation Techniques

It is known that random k-SAT formulas with at least (2 · ln 2) ·n random clauses are unsatisfiable with high probability. This result is simply obtained by bounding the expected number of satisfying assignments of a random k-SAT instance by an expression tending to 0 when n, the number of variables tends to infinity. This argument does not give us an efficient algorithm certifying the unsatisf...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Annals of Mathematical Statistics

سال: 1949

ISSN: 0003-4851

DOI: 10.1214/aoms/1177729956